The non-parametrizability of the word equation xyz=zvx: A short proof
نویسنده
چکیده
Although Makanin proved the problem of satisfiability of word equations to be decidable, the general structure of solutions is difficult to describe. In particular, Hmelevskii proved that the set of solutions of xyz= zvx cannot be described using only finitely many parameters, contrary to the case of equations in three unknowns. In this paper we give a short, elementary proof of Hmelevskii’s result. © 2005 Elsevier B.V. All rights reserved.
منابع مشابه
Groups with one conjugacy class of non-normal subgroups - a short proof
For a finite group $G$ let $nu(G)$ denote the number of conjugacy classes of non-normal subgroups of $G$. We give a short proof of a theorem of Brandl, which classifies finite groups with $nu(G)=1$.
متن کاملA SHORT PROOF FOR THE EXISTENCE OF HAAR MEASURE ON COMMUTATIVE HYPERGROUPS
In this short note, we have given a short proof for the existence of the Haar measure on commutative locally compact hypergroups based on functional analysis methods by using Markov-Kakutani fixed point theorem.
متن کاملA short proof of the maximum conjecture in CR dimension one
In this paper and by means of the extant results in the Tanaka theory, we present a very short proof in the specific case of CR dimension one for Beloshapka's maximum conjecture. Accordingly, we prove that each totally nondegenerate model of CR dimension one and length >= 3 has rigidity. As a result, we observe that the group of CR automorphisms associated with each of such models contains onl...
متن کاملOn the Closed-Form Solution of a Nonlinear Difference Equation and Another Proof to Sroysang’s Conjecture
The purpose of this paper is twofold. First we derive theoretically, using appropriate transformation on x(n), the closed-form solution of the nonlinear difference equation x(n+1) = 1/(±1 + x(n)), n ∈ N_0. The form of solution of this equation, however, was first obtained in [10] but through induction principle. Then, with the solution of the above equation at hand, we prove a case ...
متن کاملA new security proof for FMNV continuous non-malleable encoding scheme
A non-malleable code is a variant of an encoding scheme which is resilient to tampering attacks. The main idea behind non-malleable coding is that the adversary should not be able to obtain any valuable information about the message. Non-malleable codes are used in tamper-resilient cryptography and protecting memories against tampering attacks. Many different types of non-malleability have alre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 345 شماره
صفحات -
تاریخ انتشار 2005